By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 15, Issue 3, pp. 629-902

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Register Allocation for Unary–Binary Trees

P. Flajolet and H. Prodinger

pp. 629-640

BibTeX  Abstract Full Text:  PDF

Constructing $O(n\log n)$ Size Monotone Formulae for the $k$th Threshold Function of $n$ Boolean Variables

Joel Friedman

pp. 641-654

BibTeX  Abstract Full Text:  PDF

The Complexity of Counting Stable Marriages

Robert W. Irving and Paul Leather

pp. 655-667

BibTeX  Abstract Full Text:  PDF

On Deterministic Multi-Pass Analysis

Claudio Citrini, Stefano Crespi-Reghizzi, and Dino Mandrioli

pp. 668-693

BibTeX  Abstract Full Text:  PDF

The Complexity of Reliability Computations in Planar and Acyclic Graphs

J. Scott Provan

pp. 694-702

BibTeX  Abstract Full Text:  PDF

Filtering Search: A New Approach to Query-Answering

Bernard Chazelle

pp. 703-724

BibTeX  Abstract Full Text:  PDF

On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem

M. E. Dyer

pp. 725-738

BibTeX  Abstract Full Text:  PDF

Sparse Sets, Lowness and Highness

José L. Balcázar, Ronald V. Book, and Uwe Schöning

pp. 739-747

BibTeX  Abstract Full Text:  PDF

Digital Search Trees Revisited

Philippe Flajolet and Robert Sedgewick

pp. 748-767

BibTeX  Abstract Full Text:  PDF

Reducing Multiple Object Motion Planning to Graph Searching

J. E. Hopcroft and G. T. Wilfong

pp. 768-785

BibTeX  Abstract Full Text:  PDF

Church–Rosser Thue Systems that Present Free Monoids

Friedrich Otto

pp. 786-792

BibTeX  Abstract Full Text:  PDF

Three-Dimensional Circuit Layouts

Frank Thomson Leighton and Arnold L. Rosenberg

pp. 793-813

BibTeX  Abstract Full Text:  PDF

Parallel Algorithms for Depth-First Searches I. Planar Graphs

Justin R. Smith

pp. 814-830

BibTeX  Abstract Full Text:  PDF

Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze

H. B. Hunt, III and D. J. Rosenkrantz

pp. 831-850

BibTeX  Abstract Full Text:  PDF

A Binary Search with a Parallel Recovery of the Bits

Benjamin Arazi

pp. 851-855

BibTeX  Abstract Full Text:  PDF

Relative Information Capacity of Simple Relational Database Schemata

Richard Hull

pp. 856-886

BibTeX  Abstract Full Text:  PDF

Analysis of Henriksen's Algorithm for the Simulation Event Set

Jeffrey H. Kingston

pp. 887-902

BibTeX  Abstract Full Text:  PDF